A Decidable Subclass of the Minimal Godel Class with Identity
نویسندگان
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
The Importance of Being Bounded ?
In this paper we introduce and study a new class of hybrid automata, Independent Dynamics Hybrid Automata (IDA). IDA are an extension of decidable O-minimal automata in which also identity resets are allowed. We define the conditions under which reachability is decidable over IDA. These conditions involve the satisfiability of first-order formulæ that limit the interval of time we need to consi...
متن کاملInitial Segments of the Lattice of 0 1 Classes
The study of the lattice E of computably enumerable sets under inclusion has been one of the central tasks of computability theory since the 1960's. We investigate initial segments of the lattice L of 0 1 classes (of sets) under inclusion and we compare this lattice with E. It was recently proved by Nies that the theory of each interval of the lattice E which is not a boolean algebra interprets...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملTermination property of inverse finite path overlapping term rewriting system is decidable
We propose a new decidable subclass of term rewriting systems (TRSs) for which strongly normalizing (SN) property is decidable. The new class is called almost orthogonal inverse finite path overlapping TRSs (AO-FPO−1-TRSs) and the class properly includes AO growing TRSs for which SN is decidable. Tree automata technique is used to show that SN is decidable for AO-FPO−1-TRSs.
متن کاملDecidability and Universality of Quasiminimal Subshifts
We show that there exists a universal subshift having only a finite number of minimal subsystems, refuting a conjecture in [Delvenne, Kůrka, Blondel, ’05]. We then introduce the still smaller class of quasiminimal subshifts, having finitely many subsystems in total. With N-actions, their theory essentially reduces to the theory of minimal systems, but with Zactions, the class is much larger. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 49 شماره
صفحات -
تاریخ انتشار 1984